A Note On `A New Method For Solving An Arbitrary Fully Fuzzy Linear System'
Authors
Abstract:
In cite{beh}, the authors claimed by a counterexample that the cross product definition in cite{molo} is not correct and thus the proposed technique is false. In this note, we show that this assertion is incorrect.
similar resources
A method for solving fully fuzzy linear system
In this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form Ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where A~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisting o...
full textA method for solving fully fuzzy linear system with trapezoidal fuzzy numbers
Different methods have been proposed for finding the non-negative solution of fully fuzzy linear system (FFLS) i.e. fuzzy linear system with fuzzy coefficients involving fuzzy variables. To the best of our knowledge, there is no method in the literature for finding the non-negative solution of a FFLS without any restriction on the coefficient matrix. In this paper a new computational method is ...
full texta method for solving fully fuzzy linear system
in this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where a~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisti...
full textA new method for solving fully fuzzy linear Bilevel programming problems
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...
full textMy Resources
Journal title
volume 10 issue 3
pages 245- 246
publication date 2018-08-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023